Order-batching methods for an order-picking warehouse with two cross aisles
نویسندگان
چکیده
Order batching is one of the methods used in warehouses to minimize the travel distance of pickers. In this paper, we focus on developing order-batching methods for an order-picking warehouse with two cross aisles and an I/O point at one of its corners. Each of these methods is made up of one seed-order selection rule and one accompanying-order selection rule. Eleven seed-order selection rules and 14 accompanying-order selection rules are studied here. These rules include those newly proposed by us and those by others. Rules proposed by others have been shown to perform well in minimizing the travel distance of pickers. They are included here for the comparison purpose. Unlike previous studies that only focus on developing aisle or location-based rules, this study also develops rules that are distanceor area-based. In addition, two different route-planning methods and two different aisle-picking-frequency distributions are considered in this paper. This study’s objective is to investigate not only the performance of seed-order selection rules and accompanying-order selection rules, but also the mutual effects between route-planning methods, aisle-picking-frequency distributions, seed-order selection rules, and accompanying-order selection rules on their performance. The result of this study shows that some of the newly proposed rules outperform those from other studies. It also shows that seed-order selection rules and accompanyingorder selection rules significantly affect each other’s performance. Lastly, the performance rankings of seed-order selection rules and accompanying-order selection rules are affected by aisle-picking-frequency distributions, but not by route-planning methods. 2007 Elsevier Ltd. All rights reserved.
منابع مشابه
Integrated Order Batching and Distribution Scheduling in a Single-block Order Picking Warehouse Considering S-Shape Routing Policy
In this paper, a mixed-integer linear programming model is proposed to integrate batch picking and distribution scheduling problems in order to optimize them simultaneously in an order picking warehouse. A tow-phase heuristic algorithm is presented to solve it in reasonable time. The first phase uses a genetic algorithm to evaluate and select permutations of the given set of customers. The seco...
متن کاملRouting methods for warehouses with multiple cross aisles
This paper considers routing and layout issues for parallel aisle warehouses. In such warehouses order pickers walk or drive along the aisles to pick products from storage. They can change aisles at a number of cross aisles. These cross aisles are usually located at the front and back of the warehouse, but there can also be one or more cross aisles at positions in between. We describe a number ...
متن کاملA Simulation Software Tool for Order Picking in a Person-Aboard Storage/Retrieval System
A software tool is developed to simulate a person aboard automated storage/retrieval vehicle in an order pick system. The program allows the calculation of the travel time of the storage/retrieval vehicle depending on different item and order patterns, storage assignment strategies, batching methods, and routing algorithms. It consists of a set of modules, which can be extended to model a wider...
متن کاملLayout Design of Multiple Blocks Class-Based Storage Strategy Warehouses
Manual order-picking warehouses are highly influenced by its’ layout design. In fact, layout parameters play the most important role in determining the route length which is responsible for the largest share in a warehouse operating costs. Conventional simulation techniques are not capable to capture the complexities in dynamic systems. Therefore, this paper develops an agent-based model to sim...
متن کاملRouting order pickers in a warehouse with a middle aisle
This paper considers a parallel aisle warehouse, where order pickers can change aisles at the ends of every aisle and also at a cross aisle halfway along the aisles. An algorithm is presented that can find shortest order picking tours in this type of warehouses. The algorithm is applicable in warehouse situations with up to three aisle changing possibilities. Average tour length is compared for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computers & Industrial Engineering
دوره 55 شماره
صفحات -
تاریخ انتشار 2008